Balanced pairs in partial orders

نویسنده

  • Graham R. Brightwell
چکیده

An-balanced pair in a partially ordered set P = (X; <) is a pair (x; y) of elements of X such that the proportion of linear extensions of P with x below y lies between and 1 ?. The 1=3 ? 2=3 Conjecture states that, in every nite partial order P , not a chain, there is a 1 3-balanced pair. This was rst conjectured in a 1968 paper of Kislitsyn, and remains unsolved. We survey progress towards a resolution of the conjecture, and discuss some of the many related problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Partial Orders With A Fixed Number Of Comparable Pairs

In 1978, Dhar suggested a model of a lattice gas whose states are partial orders. In this context he raised the question of determining the number of partial orders with a xed number of comparable pairs. Dhar conjectured that in order to nd a good approximation to this number, it should suuce to enumerate families of layer posets. In this paper we prove this conjecture and thereby prepare the g...

متن کامل

A Batch-wise ATP Procedure in Hybrid Make-to-Order/Make-to-Stock Manufacturing Environment

Satisfying customer demand necessitates manufacturers understanding the importance of Available-To-Promise (ATP). It directly links available resources to customer orders and has significant impact on overall performance of a supply chain. In this paper, an improvement of the batch-mode ATP function in which the partial fulfillment of the orders is available will be proposed. In other words, in...

متن کامل

J un 2 01 7 Linear Extensions and Comparable Pairs in Partial Orders

We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also show that a random interval partial order on n elements has close to a third of the pairs comparable with high probability, and the number of linear extensions is n! 2−Θ(n) with high probability.

متن کامل

The Complexity of Recognizing Incomplete Single-Crossing Preferences

We study the complexity of deciding if a given profile of incomplete votes (i.e., a profile of partial orders over a given set of alternatives) can be extended to a singlecrossing profile of complete votes (total orders). This problem models settings where we have partial knowledge regarding voters’ preferences and we would like to understand whether the given preference profile may be single-c...

متن کامل

عقب‌ماندگی ذهنی مرتبط با ناهنجاری کروموزومی در یک خانواده ایرانی: گزارش سه مورد

Background: Mental retardation is defined as impaired mental capacity and ability to comply with environmental and social conditions. Chromosomal abnormalities are the most important causes of mental retardation. Carriers of balanced chromosomal translocation are phenotypically normal, although they may be at risk of infertility, recurrent miscarriage or giving birth to mentally retarded childr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 201  شماره 

صفحات  -

تاریخ انتشار 1999